Recursive equations in finite Markov chain imbedding
نویسندگان
چکیده
Abstract In this paper, recursive equations for waiting time distributions of r-th occurrence of a compound pattern are studied via the finite Markov chain imbedding technique under overlapping and non-overlapping counting schemes in sequences of independent and identically distributed (i.i.d.) or Markov dependent multi-state trials. Using the relationship between number of patterns and r-th waiting time, distributions of number of patterns can also be obtained. The probability generating functions are also obtained. Examples and numerical results are given to illustrate our theoretical results.
منابع مشابه
Recursive Equations of Reliability for Linear Consecutive - k - out - of - n : F Systems with Sparse
In this paper, some recursive equations of reliability for linear consecutivek -out-ofn : F systems with spares d are introduced. The system of consecutive failures with sparse d is a generalized extension of consecutive-k systems, which was proposed by Zhao et al. (2007) in which the reliability formulas of these systems were presented by using finite Markov Chain imbedding approach. To facili...
متن کاملReliabilities For -Out-Of- Systems
Abstract The ) , ( g f -out-of) ), , (( n j i :F ) ( g f > system consists of n components ordered in a line or a circle, while the system fails if, and only if, there are at least f failed components in the system or at least g failed components among components j j i i , 1 , , 1 , − + L (Here the component index has module n property in the circular case, i.e., components i and n+i indicate t...
متن کاملDistribution Theory of Runs and Patterns Associated with a Sequence of Multi-state Trials
Runs and patterns in a sequence of Bernoulli trials and multi-state trials have broadly been used for various purposes and in many areas of statistics and applied probability. Recently, Fu and Koutras (1994) developed a new method based on finite Markov chain imbedding technique to study the exact distributions for the number of specified runs and patterns in a sequence of Bernoulli trials. In ...
متن کاملRecursive filters for partially observable finite Markov chains
In this note, we consider discrete-time finite Markov Chains and assume that they are only partly observed. We obtain finite-dimensional normalized filters for basic statistics associated with such processes. Recursive equations for these filters are derived by means of simple computations involving conditional expectations. An application to the estimation of parameters for the so-called discr...
متن کاملStatistical inference for discretely observed Markov jump processes
Likelihood inference for discretely observed Markov jump processes with finite state space is investigated. The existence and uniqueness of the maximum likelihood estimator of the intensity matrix are investigated. This topic is closely related to the imbedding problem for Markov chains. It is demonstrated that the maximum likelihood estimator can be found either by the EM algorithm or by a Mar...
متن کامل